Kloosterman's uniformly distributed sequence
نویسندگان
چکیده
منابع مشابه
Network Location Problem with Stochastic and Uniformly Distributed Demands
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
متن کاملGenerating uniformly distributed random networks.
The analysis of real networks taken from the biological, social, and physical sciences often requires a carefully posed statistical null-hypothesis approach. One common method requires comparing real networks to an ensemble of random matrices that satisfy realistic constraints in which each different matrix member is equiprobable. We discuss existing methods for generating uniformly distributed...
متن کاملAlgebras with Uniformly Distributed Invariants
Let K be a finite abelian extension of the rational field Q. If A is a central simple algebra over K then we let [A] denote the class of A in the Brauer group B(K) of K. The Schur subgrozcp S(K) of B{K) consists of those algebra classes which contain a simple component of the group algebra K[GJ for some finite group G. M. Benard and M. Schacher [2, Theorem 1, p. 3801 have shown that if [A] is i...
متن کاملMesh Construction from Non-Uniformly Distributed and Noisy 3D Points Recovered from Image Sequence
This paper describes a novel method for constructing triangle meshes from noisy and non-uniformly distributed 3D points. It consists of two steps. (1) Noise point removal uses clustering algorithm and epipolar constraint method to identify and remove noise points from the 3D points. (2) Constructive polygonization algorithm interpolates cleaned 3D points to construct a triangle mesh of the obje...
متن کاملUniformly-Distributed Random Generation of Join Orders
In this paper we study the space of operator trees that can be used to answer a join query, with the goal of generating elements form this space at random. We solve the problem for queries with acyclic query graphs. We rst count, in O(n 3) time, the exact number of trees that can be used to evaluate a given query on n relations. The intermediate results of the counting procedure then serve to g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2003
ISSN: 0022-314X
DOI: 10.1016/s0022-314x(03)00011-8